Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Sam Olesker-Taylor and Luca Zanetti. Geometric Bounds on the Fastest Mixing Markov Chain. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, p. 109:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{oleskertaylor_et_al:LIPIcs.ITCS.2022.109, author = {Olesker-Taylor, Sam and Zanetti, Luca}, title = {{Geometric Bounds on the Fastest Mixing Markov Chain}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {109:1--109:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.109}, URN = {urn:nbn:de:0030-drops-157051}, doi = {10.4230/LIPIcs.ITCS.2022.109}, annote = {Keywords: mixing time, random walks, conductance, fastest mixing Markov chain} }
Feedback for Dagstuhl Publishing